Construction of a VC1 interpolant over triangles via edge deletion
نویسندگان
چکیده
منابع مشابه
Construction of a VC1 interpolant over triangles via edge deletion
We present a construction of a visually smooth surface which interpolates to position values and normal vectors of randomly distributed points on a 3D object. The method is local and uses quartic triangular and bicubic quadrilateral patches without splits. It heavily relies on an edge deleting algorithm which, starting from a given triangulation, derives a suitable combination of threeand four ...
متن کاملEdge-Constrained Marching Triangles
Marching triangles is a method for producing a polygon mesh surface approximation composed of triangular facets which are approximately equilateral. This paper improves the Marching Triangles algorithm where the inputs are multiple range images of scenes. C discontinuities (fold edges) are detected and used to constrain the final triangulation, thus increasing the accuracy of the mesh at sharp ...
متن کاملdiscursive motivation/demotivation construction: a case of iranian efl majors
بررسی نقش گفتمان در شکل گیری یا کاهش انگیزش فراگیران زبان خارجی موضوع تحقیق نسبتاً جدیدی است. از این رو، تحقیقات کمی در این زمینه وجود دارد. به منظور پر کردن این خلاء ، مطالعه کنونی به بررسی فرآیند گفتمان مدار شکل گیری یا کاهش انگیزش دانشجویان ایرانی زبان انگلیسی پرداخت. نخست، این مطالعه به صورت آزمایشی با 7 نفر (? دانشجوی پسر و 5 دختر) از دانشجویان سال دوم دوره ی کارشناسی زبان و ادبیات انگلیسی ...
Many Empty Triangles have a Common Edge
Given a finite point set X in the plane, the degree of a pair {x, y} ⊂ X is the number of empty triangles t = conv{x, y, z}, where empty means t∩X = {x, y, z}. Define degX as the maximal degree of a pair in X. Our main result is that if X is a random sample of n independent and uniform points from a fixed convex body, then degX ≥ cn/ lnn in expectation.
متن کاملPacking Edge Disjoint Triangles: A Parameterized View
The problem of packing k edge-disjoint triangles in a graph has been thoroughly studied both in the classical complexity and the approximation fields and it has a wide range of applications in many areas, especially computational biology [BP96]. In this paper we present an analysis of the problem from a parameterized complexity viewpoint. We describe a fixed-parameter tractable algorithm for th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computer Aided Geometric Design
سال: 1994
ISSN: 0167-8396
DOI: 10.1016/0167-8396(94)90058-2